The parity Hamiltonian cycle problem
نویسندگان
چکیده
منابع مشابه
The parity Hamiltonian cycle problem
This paper investigates a variant of the Hamiltonian Cycle (HC) problem, named the Parity Hamiltonian Cycle (PHC ) problem: The problem is to find a closed walk visiting each vertex odd number of times, instead of exactly once. We show that the PHC problem is in P even when a closed walk is allowed to use an edge at most z = 4 times, by considering a T -join, which is a generalization of matchi...
متن کاملThe Hamiltonian Strictly Alternating Cycle Problem
In this paper we consider an approach to solve the Hamiltonian strictly alternating cycle problem. This approach is based on constructing logical models for the problem.
متن کاملReducing the generalised Sudoku problem to the Hamiltonian cycle problem
The generalised Sudoku problem with N symbols is known to be NP-complete, and hence is equivalent to any other NP-complete problem, even for the standard restricted version where N is a perfect square. In particular, generalised Sudoku is equivalent to the, classical, Hamiltonian cycle problem. A constructive algorithm is given that reduces generalised Sudoku to the Hamiltonian cycle problem, w...
متن کاملHamiltonian Cycle Problem on Distance-Hereditary Graphs
All graphs considered in this paper are finite and undirected, without loops or multiple edges. Let G = (V, E) be a graph. Throughout this paper, let m and n denote the numbers of edges and vertices of graph G, respectively. A connected graph is distance-hereditary if the distance between every two vertices in a connected induced subgraph is the same as that in the original graph. Distance-here...
متن کاملHamiltonian Cycle Problem for Triangle Graphs
We show that the Hamiltonian cycle problem is NP-complete for a class of planar graphs named triangle graphs that are closely related to inner-triangulated graphs. We present a linear-time heuristic algorithm that nds a solution at most one-third longer than the optimum solution and use it to obtain a fast rendering algorithm on triangular meshes in computer graphics.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discrete Mathematics
سال: 2018
ISSN: 0012-365X
DOI: 10.1016/j.disc.2017.10.025